Structural Rewriting in the π-Calculus
نویسنده
چکیده
We consider reduction in the synchronous π-calculus with replication, without sums. Usual definitions of reduction in the π-calculus use a closure w.r.t. structural congruence of processes. In this paper we operationalize structural congruence by providing a reduction relation for piprocesses which also performs necessary structural conversions explicitly by rewrite rules. As we show, a subset of structural congruence axioms is sufficient. We show that our rewrite strategy is equivalent to the usual strategy including structural congruence w.r.t. the observation of barbs and thus w.r.t. mayand should-testing equivalence in the pi-calculus. 1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems, F.3.2 Semantics of Programming Languages, D.3.1 Formal Definitions and Theory
منابع مشابه
A Graph Rewriting Semantics for the Polyadic Calculus
We give a hypergraph rewriting semantics for the polyadic π-calculus, based on rewriting rules equivalent to those in the double-pushout approach. The structural congruence of the π-calculus is replaced by hypergraph isomorphism. The correctness of the encoding from the graph-based notation into π-calculus can be shown by using an intermediate notation, so-called name-based graph terms.
متن کاملGraph Rewriting for the π - calculus †
We propose a graphical implementation for (possibly recursive) processes of the π-calculus, encoding each process into a graph. Our implementation is sound and complete with respect to the structural congruence for the calculus: Two processes are equivalent if and only if they are mapped into graphs with the same normal form. Most importantly, the encoding allows the use of standard graph rewri...
متن کاملRewriting Modulo \beta in the \lambda\Pi-Calculus Modulo
The λ Π-calculus Modulo is a variant of the λ -calculus with dependent types where β -conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type systems in a shallow way. Basic properties such as subject reduction or uniqueness of types do not hold in general in the λ Π-calculus Modulo. However, they hold if the rewr...
متن کاملMultiport Interaction Nets and Concurrency
We consider an extension of Lafont’s Interaction Nets, called Multiport Interaction Nets, and show that they are a model of concurrent computation by encoding the full π-calculus in them. We thus obtain a faithful graphical representation of the π-calculus in which every reduction step is decomposed in fully local graph-rewriting rules.
متن کاملMultiset Rewriting: A Semantic Framework for Concurrency with Name Binding
We revise multiset rewriting with name binding, by combining the two main existing approaches to the study of concurrency by means of multiset rewriting, multiset rewriting with existential quantification and constrained multiset rewriting. We obtain ν-MSRs, where we rewrite multisets of atomic formulae, in which some names may be restricted. We prove that ν-MSRs are equivalent to a class of Pe...
متن کامل